Quasi-linear truth-table reductions to p-selective sets
نویسندگان
چکیده
منابع مشابه
On Sets Bounded Truth-Table Reducible to P-selective Sets
We show that if every NP set is polynomial time bounded truth table reducible to some P selective set then NP is contained in DTIME n O p logn In the proof we implement a recursive procedure that reduces the number of nondeterministic steps of a given nondeter ministic computation
متن کاملDeterministic and Randomized Bounded Truth-Table Reductions of P, NL, and L to Sparse Sets
We prove that there is no sparse hard set for P under logspace computable bounded truth-table reductions unless P=L. In case of reductions computable in NC, the collapse goes down to P=NC. We parameterize this result and obtain a generic theorem allowing us to vary the sparseness condition, the space bound and the number of queries of the truth-table reduction. Another instantiation yields that...
متن کاملBounded Truth Table Reductions of PJin
If there is a sparse set hard for P under bounded truth table reductions computable in LOGSPACE or NC 2 , then P = NC 2. We give the details of the proof to this theorem.
متن کاملPP is Closed Under Truth-Table Reductions
Beigel, Reingold and Spielman 2] showed that PP is closed under intersection and a variety of special cases of polynomial-time truth-table closure. We extend the techniques in 2] to show PP is closed under general polynomial-time truth-table reductions. We also show that PP is closed under constant-round truth-table reductions.
متن کاملOn Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain types of deterministic randomized and nondeterministic reductions We show that if an NP complete set is bounded truth table reducible to some set that conjunctively reduces to a sparse set then P NP This result subsumes and extends previously known results yielding a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(95)00167-0